翻訳と辞書 Words near each other ・ Least pipistrelle ・ Least poorwill ・ Least publishable unit ・ Least puffer ・ Least pygmy squirrel ・ Least restrictive environment ・ Least sandpiper ・ Least seedsnipe ・ Least shrew tenrec ・ Least significant bit ・ Least slack time scheduling ・ Least soft-furred mouse ・ Least squares ・ Least squares adjustment ・ Least squares conformal map ・ Least squares inference in phylogeny ・ Least squares support vector machine ・ Least storm petrel ・ Least tern ・ Least tiger ・ Least trimmed squares ・ Least weasel ・ Least willow ・ Least woolly bat ・ Least yellow bat ・ Least-angle regression ・ Least-concern species ・ Least-cost planning methodology ・ Least-cost routing ・ Least-squares function approximation Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Least squares inference in phylogeny ： ウィキペディア英語版 Least squares inference in phylogeny Least squares inference in phylogeny generates a phylogenetic tree based on an observed matrix of pairwise genetic distances and optionally a weight matrix. The goal is to find a tree which satisfies the distance constraints as best as possible. ==Ordinary and weighted least squares== The discrepancy between the observed pairwise distances $D\_$ and the distances $T\_$ over a phylogenetic tree (i.e. the sum of the branch lengths in the path from leaf $i$ to leaf $j$) is measured by :$S\; =\; \backslash sum\_\; w\_\; (D\_-T\_)^2$ where the weights $w\_$ depend on the least squares method used. Least squares distance tree construction aims to find the tree (topology and branch lengths) with minimal S. This is a non-trivial problem. It involves searching the discrete space of unrooted binary tree topologies whose size is exponential in the number of leaves. For n leaves there are 1 • 3 • 5 • ... • (2n-3) different topologies. Enumerating them is not feasible already for a small number of leaves. Heuristic search methods are used to find a reasonably good topology. The evaluation of S for a given topology (which includes the computation of the branch lengths) is a linear least squares problem. There are several ways to weight the squared errors $(D\_-T\_)^2$, depending on the knowledge and assumptions about the variances of the observed distances. When nothing is known about the errors, or if they are assumed to be independently distributed and equal for all observed distances, then all the weights $w\_$ are set to one. This leads to an ordinary least squares estimate. In the weighted least squares case the errors are assumed to be independent (or their correlations are not known). Given independent errors, a particular weight should ideally be set to the inverse of the variance of the corresponding distance estimate. Sometimes the variances may not be known, but they can be modeled as a function of the distance estimates. In the Fitch and Margoliash method 〔Fitch WM, Margoliash E. (1967). Construction of phylogenetic trees. ''Science'' 155: 279-84.〕 for instance it is assumed that the variances are proportional to the squared distances. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Least squares inference in phylogeny」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.